Evaluation of Lower Bounding Methods of Dynamic Time Warping (DTW)

نویسندگان

  • Happy Nath
  • Ujwala Baruah
چکیده

This paper presents a brief review on the lower bounding(LB) methods applied on Dynamic Time Warping(DTW) till now. Apart from providing a survey on the methods, an attempt has been made to compare these methods in terms of constraints involved with these methods. Some Lower Bounding (LB) methods have better pruning power than others, some are better in terms of running time and also there are some which do introduce greater number of false dismissals than others. This work will help researchers in selecting a suitable lower bounding method for their application. The authors hope that this work will provide a scope of evaluating Lower bounding distances of DTW in the area of speech recognition and verification in general and will also help identify research topic and application in this area.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Lower-Bounding of Dynamic Time Warping Distances for Multivariate Time Series

A tight lower-bounding measure for dynamic time warping (DTW) distances for univariate time series was introduced in [Keogh 2002] and a proof for its lower-bounding property was presented. Here we extend these findings to allow lower-bounding of DTW distances for multivariate time series.

متن کامل

Faster Sequential Search with a Two-Pass Dynamic-Time-Warping Lower Bound

The Dynamic Time Warping (DTW) is a popular similarity measure between time series. The DTW fails to satisfy the triangle inequality and its computation requires quadratic time. Hence, to find closest neighbors quickly, we use bounding techniques. We can avoid most DTW computations with an inexpensive lower bound (LB Keogh). We compare LB Keogh with a tighter lower bound (LB Improved). We find ...

متن کامل

Faster retrieval with a two-pass dynamic-time-warping lower bound

The Dynamic Time Warping (DTW) is a popular similarity measure between time series. The DTW fails to satisfy the triangle inequality and its computation requires quadratic time. Hence, to find closest neighbors quickly, we use bounding techniques. We can avoid most DTW computations with an inexpensive lower bound (LB Keogh). We compare LB Keogh with a tighter lower bound (LB Improved). We find ...

متن کامل

Fast Similarity Search of Multi-Dimensional Time Series via Segment Rotation

Multi-dimensional time series is playing an increasingly important role in the “big data” era, one noticeable representative being the pervasive trajectory data.Numerous applications ofmulti-dimensional time series all require to find similar time series of a given one, and regarding this purpose, Dynamic Time Warping (DTW) is the most widely used distance measure. Due to the high computation o...

متن کامل

Robot Arm Performing Writing through Speech Recognition Using Dynamic Time Warping Algorithm

This paper aims to develop a writing robot by recognizing the speech signal from the user. The robot arm constructed mainly for the disabled people who can’t perform writing on their own. Here, dynamic time warping (DTW) algorithm is used to recognize the speech signal from the user. The action performed by the robot arm in the environment is done by reducing the redundancy which frequently fac...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2014